A new class of hyper-bent functions and Kloosterman sums

نویسندگان

  • Chunming Tang
  • Yanfeng Qi
چکیده

This paper is devoted to the characterization of hyper-bent functions. Several classes of hyper-bent functions have been studied, such as Charpin and Gong’s ∑ r∈R Tr1 (arx r(2m−1)) and Mesnager’s ∑ r∈R Tr1 (arx r(2m−1)) + Tr1(bx 2n−1 3 ), where R is a set of representations of the cyclotomic cosets modulo 2 + 1 of full size n and ar ∈ F2m . In this paper, we generalize their results and consider a class of Boolean functions of the form ∑ r∈R ∑2 i=0 Tr n 1 (ar,ix r(2−1)+ 2 n−1 3 ) + Tr 1(bx 2n−1 3 ), where n = 2m, m is odd, b ∈ F4, and ar,i ∈ F2n . With the restriction of ar,i ∈ F2m , we present the characterization of hyper-bentness of these functions with character sums. Further, we reformulate this characterization in terms of the number of points on hyper-elliptic curves. For some special cases, with the help of Kloosterman sums and cubic sums, we determine the characterization for some hyper-bent functions including functions with four, six and ten traces terms. Evaluations of Kloosterman sums at three general points are used in the characterization. Actually, our results can generalized to the general case: ar,i ∈ F2n . And we explain this for characterizing binomial, trinomial and quadrinomial hyper-bent functions. Index Terms Bent function, hyper-bent functions, Walsh-Hadamard transform, Dickson polynomial, Kloosterman sums

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Value 4 of Binary Kloosterman Sums

Kloosterman sums have recently become the focus of much research, most notably due to their applications in cryptography and their relations to coding theory. Very recently Mesnager has showed that the value 4 of binary Kloosterman sums gives rise to several infinite classes of bent functions, hyper-bent functions and semi-bent functions in even dimension. In this paper we analyze the different...

متن کامل

Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice

Hyper-bent functions as a subclass of bent functions attract much interest and it is elusive to completely characterize hyper-bent functions. Most of known hyper-bent functions are Boolean functions with Dillon exponents and they are often characterized by special values of Kloosterman sums. In this paper, we present a method for characterizing hyper-bent functions with Dillon exponents. A clas...

متن کامل

A new class of hyper-bent Boolean functions in binomial forms

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals 2 ± 2n2 , were introduced by Rothaus in 1976 when he considered problems in combinatorics. Bent functions have been extensively studied due to their applications in cryptography, such as S-box, block cipher and stream cipher. Further...

متن کامل

Special values of Kloosterman sums and binomial bent functions

Let p ≥ 7, q = p. Kq(a) = ∑ x∈Fpm ζ m 1 (x m−2+ax) is the Kloosterman sum of a on Fpm , where ζ = e 2π √ −1 p . The value 1− 2 ζ+ζ−1 of Kq(a) and its conjugate have close relationship with a class of binomial function with Dillon exponent. This paper first presents some necessary conditions for a such that Kq(a) = 1− 2 ζ+ζ−1 . Further, we prove that if p = 11, for any a, Kq(a) 6= 1− 2 ζ+ζ−1 . A...

متن کامل

A generalization of the class of hyper-bent Boolean functions in binomial forms

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals 2n−1 ± 2n2−1, were introduced by Rothaus in 1976 when he considered problems in combinatorics. Bent functions have been extensively studied due to their applications in cryptography, such as S-box, block cipher and stream cipher. Fur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013